<HTML><HEAD><TITLE>ord_intersect(+Set1, +Set2)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(ordset)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>ord_intersect(+Set1, +Set2)</H1>
Checks whether two sets have a non-empty intersection
<DL>
<DT><EM>Set1</EM></DT>
<DD>A set
</DD>
<DT><EM>Set2</EM></DT>
<DD>A set
</DD>
</DL>
<H2>Description</H2>
	Succeeds when the two ordered sets have at least one element
	in common.  Note that the test is == rather than = .
    
<H3>Modes and Determinism</H3><UL>
<LI>ord_intersect(+, +) is semidet
</UL>
<H2>See Also</H2>
<A HREF="../../lib/ordset/ord_disjoint-2.html">ord_disjoint / 2</A>
</BODY></HTML>
